منابع مشابه
Optimization of Dynamically Generated Sql Queries for Tiny-huge, Huge-tiny Problem
In most new commercial business software applications like Customer Relationship Management, the data is stored in the database layer which is usually a Relational Database Management System (RDBMS) like Oracle, DB2 UDB or SQL Server. To access data from these databases, Structured Query Language (SQL) queries are used that are generated dynamically at run time based on defined business models ...
متن کاملGraphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
Karger, Motwani and Sudan (JACM 1998) introduced the notion of a vector coloring of a graph. In particular they show that every k-colorable graph is also vector kcolorable, and that for constant k, graphs that are vector kcolorable can be colored by roughly 1 2=k colors. Here is the maximum degree in the graph. Their results play a major role in the best approximation algorithms for coloring an...
متن کاملA cleaner doctor's kit: tiny bubbles mean huge improvements.
Introduction Nosocomial pneumonia is a major source of morbidity and mortality after severe burns. Burned patients suffer trace element deficiencies and depressed antioxidant and immune defences. This study aimed at determining the effect of trace element supplementation on nosocomial or intensive care unit (ICU)-acquired pneumonia. Methods Two consecutive, randomised, double-blinded, supplemen...
متن کاملRBO Protocol: Broadcasting Huge Databases for Tiny Receivers
We propose a protocol (called RBO) for broadcasting long streams of single-packet messages over radio channel for tiny, battery powered, receivers. The messages are labeled by the keys from some linearly ordered set. The sender repeatedly broadcasts a sequence of many (possibly millions) of messages, while each receiver is interested in reception of a message with a specified key within this se...
متن کاملGraphs with tiny vector chromatic numbers and huge chromatic numbers Extended Abstract
Karger, Motwani and Sudan (JACM 1998) introduced the notion of a vector coloring of a graph. In particular they show that every k-colorable graph is also vector kcolorable, and that for constant k, graphs that are vector kcolorable can be colored by roughly k colors. Here is the maximum degree in the graph. Their results play a major role in the best approximation algorithms for coloring and fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science Bulletin
سال: 2020
ISSN: 2095-9273
DOI: 10.1016/j.scib.2020.02.024